منابع مشابه
Theory of Resource Allocation for Robust Distributed Computing
Lately, distributed computing (DC) has emerged in several application scenarios such as grid computing, high-performance and reconfigurable computing, wireless sensor networks, battle management systems, peer-to-peer networks, and donation grids. When DC is performed in these scenarios, the distributed computing system (DCS) supporting the applications not only exhibits heterogeneous computing ...
متن کاملA Claim-Collide Mechanism for Robust Distributed Resource Allocation
Much previous work has been done on distributed dynamic resource allocation, and there are a number of solutions. Unfortunately, pragmatic mechanisms for Internetwide resource allocation have not received much attention in the research literature. The key challenges for Internet-wide resource allocation are scale and robustness. As the number of resource managers scale, the overall resource uti...
متن کاملRobust resource allocation in a cluster based imaging system
0167-8191/$ see front matter 2009 Elsevier B.V doi:10.1016/j.parco.2009.03.001 q The robustness portions of this research were su Endowment. * Corresponding author. Address: DigitalGlobe, Lo E-mail addresses: [email protected] (J @infoprint.com (S. Price), [email protected] Recently there has been an increased demand for imaging systems in support of highspeed digital printing....
متن کاملA robust optimisation approach to project scheduling and resource allocation
In a rapidly changing and highly uncertain environment, Petri net-based project management systems can be used in the rescheduling (control reconfiguration) of projects, when unforeseen changes occur or new data estimates become available. However, having to reschedule the project after it has started can result in significant suboptimality due to increased cost. In this paper, we present a sol...
متن کاملA Simple Theory of Traffic and Resource Allocation in Atm
We propose a simple framework to study the tradeoffs between bandwidth and buffer in an ATM network. Traffic is modeled as a deterministic fluid. The key concept is the burstiness curve b ( p ) which gives, for a connection, the maximum number b ( p ) of cells that must be buffered if the connection is served at a fixed rate of p cells per second. Two popular service disciplines the fixed rate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 1996
ISSN: 1556-5068
DOI: 10.2139/ssrn.1375209